An Exhaustive Study on different Sudoku Solving Techniques
نویسندگان
چکیده
Sudoku’ is the Japanese abbreviation of a longer phrase, ‘Suuji wa dokushin ni kagiru’, meaning ‘the digits must remain single’. It is a very popular puzzle that trains our logical mind. There are several approaches to solve this well-liked puzzle. In any case, the problem of solving a given Sudoku puzzle finds numerous applications in practice. In this paper, an exhaustive study has been made on different techniques for solving a Sudoku puzzle.
منابع مشابه
There Is No 16-Clue Sudoku: Solving the Sudoku Minimum Number of Clues Problem via Hitting Set Enumeration
The sudoku minimum number of clues problem is the following question: what is the smallest number of clues that a sudoku puzzle can have? For several years it had been conjectured that the answer is 17. We have performed an exhaustive computer search for 16-clue sudoku puzzles, and did not find any, thus proving that the answer is indeed 17. In this article we describe our method and the actual...
متن کاملSudokuSat-A Tool for Analyzing Difficult Sudoku Puzzles
Sudoku puzzles enjoy world-wide popularity, and a large community of puzzlers is hoping for ever more difficult puzzles. A crucial step for generating difficult Sudoku puzzles is the fast assessment of the difficulty of a puzzle. In a study in 2006, it has been shown that SAT solving provides a way to efficiently differentiate between Sudoku puzzles according to their difficulty, by analyzing w...
متن کاملar X iv : 1 20 1 . 07 49 v 1 [ cs . D S ] 1 J an 2 01 2 There is no 16 - Clue Sudoku : Solving the Sudoku Minimum Number of Clues Problem
We apply our new hitting set enumeration algorithm to solve the sudoku minimum number of clues problem, which is the following question: What is the smallest number of clues (givens) that a sudoku puzzle may have? It was conjectured that the answer is 17. We have performed an exhaustive search for a 16-clue sudoku puzzle, and we did not find one, thereby proving that the answer is indeed 17. Th...
متن کاملThere is no 16-Clue Sudoku: Solving the Sudoku Minimum Number of Clues Problem
We apply our new hitting set enumeration algorithm to solve the sudoku minimum number of clues problem, which is the following question: What is the smallest number of clues (givens) that a sudoku puzzle may have? It was conjectured that the answer is 17. We have performed an exhaustive search for a 16-clue sudoku puzzle, and we did not find one, thereby proving that the answer is indeed 17. Th...
متن کاملA Hybrid Heuristic Approach for the Sudoku problem
Sudoku is not only a popular puzzle but also an interesting constraint satisfaction problem. Therefore automatic solving methods for this problem have been the subject of several publications in the last decade. While some authors propose algorithms which make use of constraint programming techniques, others propose meta-heuristics and stochastic search to tackle larger instances of the puzzle....
متن کامل